The proposed models to assess the security risks of bridges are generally designed based on the product of three-factor: probability (O), vulnerability (V), and importance (I). In this paper, the importance of bridge (I) and its changes due to the uncertainty of NETWORK TOPOLOGY during future NETWORK development programs were discussed. To measure and compare the relative importance of bridges, two groups of unique importance and the NETWORK-based importance of bridges were considered. Given that the NETWORK-based characteristics of bridges change during NETWORK development, a numerical example was presented to compare different decision-making approaches in selecting bridges (with and without considering the changes in the importance of bridge NETWORKs due to NETWORK changes). In this example, the Ahwaz inter-city transportation NETWORK was examined. The results showed that some bridges, such as B3, which were not important in the initial, became important during the development process. In contrast, in some bridges, such as B5, the relative importance was high at first, but during the development process, their relative importance decreased. It was also observed that a number of bridges such as B1, B6, and B7 are always important. In contrast, bridges such as B4 are always considered insignificant and NETWORK changes do not place them among the important bridges in any period.

NETWORK sensors consist of sensor nodes in which every node covers a limited area. The most common use of these NETWORKs is in unreachable fields.Sink is a node that collects data from other nodes. One of the main challenges in these NETWORKs is the limitation of nodes battery (power supply).Therefore, the use of TOPOLOGY control is required to decrease power consumption and increase NETWORK accessibility.In this paper, a NETWORK is modeled by a graph. Each vertex in the graph indicates a sensor node and the edges display the communication links between them. Changes in the graph show changes in NETWORK TOPOLOGY and a different path to the sink.In this research, “fuzzy logic” is used for TOPOLOGY control. As the fuzzy logic utilizes optimized sensing radius comparing with minimum-maximum sensing radius, we expect less dead nodes, more mean residual energy and relatively more load balance in the NETWORK. At first, 2-input fuzzy algorithm was chosen. However 3-input fuzzy algorithm was also observed due to reasons explained in the main text.In both algorithms, we have load balance in NETWORK and prolong NETWORK lifetime. Unreachable paths are less encountered with higher rates of packet delivery. The final standard deviation (STD) reaches to its minimum level, while the residual energy in sensors remains close to each other.

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to NETWORK size, and flexibility on node join and departure. However, Chord doesn’t take into account the TOPOLOGY of underlying physical NETWORK when a new node is being added to the system, thus resulting in high routing latency and low efficiency in data lookup. In this paper, we introduce the TAC, a novel TOPOLOGY-aware protocol which is based on Chord. TAC introduces the local ring concept by dividing the geographical space into smaller areas. Through binding each new node to a proper local ring concerning its physical location, TAC considers the physical NETWORK TOPOLOGY of the overlay NETWORK to demonstrate more efficient key lookup. Simulation results show that TAC performs better in terms of more efficient routing and less bandwidth usage.

The concentration of fossil fuel resources in specific geographic regions of the world and the strategic nature of fuel as a tradable commodity has created an intertwined and complex NETWORK of trade relationships among importing and exporting countries of fuel. In this research, using Graph Theory, the TOPOLOGY of the fuel trade NETWORK in 1995 and 2017 is analyzed and the position and significance of the main actors of the fuel trade were evaluated. The results show that the fuel trade NETWORK is a fully connected NETWORK with different growth patterns of trade clusters. It was also observed that countries with higher export share do not necessarily have a greater influence on the volume of fuel trade. While increasing the share of fuel trade, countries tend to trade beyond trade clusters. We also found that changes in trade clusters indicate a more regionalized trade in fuel. Finally, the results show a decrease in Iran's influence in fuel trade.

The stock market is a complex financial system with heterogeneous members; it can produce huge amounts of data. It is clear that analyzing this huge data and inferring practical results from that creates a significant competitive advantage for its participants. One method of analyzing financial market data expanded significantly after the global financial crisis is complex NETWORK-based analysis that considers the structure of interdependencies of a system's members. Therefore, the current study analyzes the Iranian stock market using the graph theory in mathematics. First, the correlation NETWORK of stock market groups is constructed in three time scales of daily, seasonal and annual, and then their TOPOLOGY will be compared. In the next stage, using the centrality indexes in the graph theory, the importance of each market group is calculated and the groups are ranked in the NETWORK. The results of this study have significant implications for market participants and regulators for making investment decisions, regulating and controlling risk.

NETWORK-on-chip (NoC) paradigm, which is based on a modular packet-switched mechanism, effectively addresses many of the on-chip communication challenges such as wiring complexity, communication latency, and bandwidth of many-core systems. In designing an efficient NoC, TOPOLOGY and routing algorithm are the most im-portant challenging issues that have signi cant impact on area, latency and power consumption. The goal of this paper is designing a fuzzy-based routing algorithm for a NoC architecture with honeycomb TOPOLOGY. The proposed algorithm is a live-lock and deadlock free routing algorithm based on fuzzy logic for hexagonal zones with at triple coordinate system. The analysis of simulation results demonstrates that the proposed algorithm, provides higher performance in terms of latency, power consumption, throughput and area than a traditional fuzzy-based routing algorithm for mesh-based NoC architectures. Comparing to a non-fuzzy routing algorithm for honeycomb NoCs, the proposed scheme performs faster with higher throughput with a negligible area and power consumption overhead.